#include<bits/stdc++.h>
#define int long long
using namespace std;
struct node
{
	int x,cnt;
};
vector<node> v;
int n,ans,sum,cnt=1,a[100010];
signed main()
{
	freopen("duel.in","r",stdin),freopen("duel.out","w",stdout);
	cin>>n,ans=n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	sort(a+1,a+n+1);
	for(int i=2;i<=n+1;i++)
	{
		if(a[i]==a[i-1])
			cnt++;
		else
		{
			v.push_back({a[i-1],cnt}),cnt=1;
		}
	}
	//for(int i=0;i<v.size();i++)
	//	cout<<v[i].x<<' '<<v[i].cnt<<'\n';
	sum=v[0].cnt;
	for(int i=1;i<v.size();i++)
	{
		cnt=v[i].cnt,sum-=min(cnt,sum),sum+=cnt;
	}
	cout<<sum;
}
